منابع مشابه
Disjunctive Rado numbers
If L1 and L2 are linear equations, then the disjunctive Rado number of the set {L1, L2} is the least integer n, provided that it exists, such that for every 2-coloring of the set {1, 2, . . . , n} there exists a monochromatic solution to either L1 or L2. If such an integer n does not exist, then the disjunctive Rado number is infinite. In this paper, it is shown that for all integers a 1 and b ...
متن کاملOn Erdös-Rado Numbers
In this paper new proofs of the Canonical Ramsey Theorem, which originally has been proved by ErdSs and Rado, are given. These yield improvements over the known bounds for the arising Erd6s-Rado numbers ER(k; l), where the numbers ER(k; l) are defined as the least positive integer n such that for every partition of the k-element subsets of a totally ordered n-element set X into an arbitrary num...
متن کاملBetter Bounds on Rado Numbers
This was first proven by van der Warden [6]. See the books by Graham, Rothchild, and Spencer [3], Landman and Robertson [4] or the free on-line book of Gasarch, Kruskal, Parrish [1] for the proof in English. This proof gives enormous upper bounds on the numbers W (k, c) that are not primitive recursive. Shelah [5] gave an alternative proof that yields primitive recursive upper bounds. All of th...
متن کاملTwo Color Off-diagonal Rado-type Numbers
We show that for any two linear homogeneous equations E0, E1, each with at least three variables and coefficients not all the same sign, any 2-coloring of Z+ admits monochromatic solutions of color 0 to E0 or monochromatic solutions of color 1 to E1. We define the 2-color off-diagonal Rado number RR(E0, E1) to be the smallest N such that [1, N ] must admit such solutions. We determine a lower b...
متن کاملOn some Rado numbers for generalized arithmetic progressions
The 2-color Rado number for the equation x1 + x2 − 2x3 = c, which for each constant c ∈ Z we denote by S1(c), is the least integer, if it exists, such that every 2-coloring, ∆ : [1, S1(c)]→ {0, 1}, of the natural numbers admits a monochromatic solution to x1 +x2−2x3 = c, and otherwise S1(c) = ∞. We determine the 2-color Rado number for the equation x1 + x2 − 2x3 = c, when additional inequality ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series A
سال: 1997
ISSN: 0097-3165
DOI: 10.1006/jcta.1997.2810